N ov 2 00 7 KEYS AND ALTERNATING SIGN MATRICES
نویسنده
چکیده
In [11], Lascoux and Schützenberger introduced a notion of key associated to any Young tableau. More recently Lascoux [9] defined the key of an alternating sign matrix by recursively removing all −1’s in such matrices. But alternating sign matrices are in bijection with monotone triangles, which form a subclass of Young tableaux. We show that in this case these two notions of keys coincide. Moreover we obtain an elegant and direct way to compute the key of any Young tableau, and discuss consequences of our result.
منابع مشابه
1 8 M ay 2 00 9 KEYS AND ALTERNATING SIGN MATRICES
In [12], Lascoux and Schützenberger introduced a notion of key associated to any Young tableau. More recently Lascoux defined the key of an alternating sign matrix by recursively removing all −1’s in such matrices. But alternating sign matrices are in bijection with monotone triangles, which form a subclass of Young tableaux. We show that in this case these two notions of keys coincide. Moreove...
متن کاملKeys and Alternating Sign Matrices
In [12], Lascoux and Schützenberger introduced a notion of key associated to any Young tableau. More recently Lascoux defined the key of an alternating sign matrix by recursively removing all −1’s in such matrices. But alternating sign matrices are in bijection with monotone triangles, which form a subclass of Young tableaux. We show that in this case these two notions of keys coincide. Moreove...
متن کاملOn the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
Feistel constructions have been shown to be indifferentiable from random permutations at STOC 2011. Whereas how to properly mix the keys into an un-keyed Feistel construction without appealing to domain separation technique to obtain a block cipher which is provably secure against known-key and chosen-key attacks (or to obtain an ideal cipher) remains an open problem. We study this, particularl...
متن کاملOn Feistel ciphers with alternating round functions and whitening keys
In [1] it was shown that a n-bit balanced Feistel cipher with identical round functions and independent preand post-whitening keys can be broken using n2n=2+1 chosen plaintexts in O(n2n=2) time and space. This paper presents an extension of that result showing that the “sliding with a twist” technique of [2] can be used to break a more general class of Feistel cipher with essentially the same r...
متن کاملKey-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
This paper considers—for the first time—the concept of keyalternating ciphers in a provable security setting. Key-alternating ciphers can be seen as a generalization of a construction proposed by Even and Mansour in 1991. This construction builds a block cipher PX from an n-bit permutation P and two n-bit keys k0 and k1, setting PXk0,k1(x) = k1 ⊕ P (x ⊕ k0). Here we consider a (natural) extensi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009